Lower Bound of Newton Number

نویسندگان

  • Masako Furuya
  • Kazumasa Ikeda
چکیده

We show a lower estimate of the Milnor number of an isolated hypersurface singularity, via its Newton number. We also obtain analogous estimate of the Milnor number of an isolated singularity of a similar complete intersection variety. Introduction We study the Newton number of a polyhedron in order to calculate the Milnor number of an isolated singularity defined by an analytic mapping. Section 2 treats the Newton number of a quasi-convenient polyhedron. In Section 3, we consider the Milnor number μ(f, 0) of an isolated hypersurface singular point 0 ∈ C defined by a function f ∈ C{z1, · · · , zn}. It is well known that the Milnor number of a critical point 0 of a semi-quasihomogeneous function f is equal to that of its initial part ([MO]-Thm.1, [A]-Thm.3.1, [LR]-Cor.2.4). On the other hand, Kouchnirenko proved that μ(f, 0) ≥ ν(f) holds for any function f ∈ C[[z1, · · · , zn]], where ν(f) is the Newton number of f ([K]). We show a lower estimate of μ(f, 0) for not necessarily semiquasihomogeneous function f as follows, μ(f, 0) ≥ ν(g) ≥ (a1 − 1) · · · · · (an − 1), where (a1, 0, · · · , 0), · · · , (0, · · · , 0, an) are vertices of an arbitrary n− 1 dimensional simplex lying below Γ(f) with ai ≥ 1 (i = 1, · · · , n), and g is a standard modification of f to a convenient function. When all the ai are integers, this result follows from Kouchnirenko’s Theorem and upper semicontinuity of μ under a deformation. Recently Tomari and I have given a simple proof of this theorem which is quite different from the one of this note ([TF]). In Section 4, we mention a μ-constant family of an isolated hypersurface singularity. In Section 5, we consider the case of complete intersection singularities. Oka obtained a formula of the Milnor number of an isolated similar complete intersection singularity ([O2]) which is a generalization of Kouchnirenko’s formula ([K]). We also obtain a lower estimate of the Milnor number of an isolated similar complete intersection singularity. running title. Newton number 2000 Mathematics Subject Classification. Primary 14B05; Secondary 32S05.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The lower bound for the number of 1-factors in generalized Petersen graphs

‎In this paper‎, ‎we investigate the number of 1-factors of a‎ ‎generalized Petersen graph $P(N,k)$ and get a lower bound for the‎ ‎number of 1-factors of $P(N,k)$ as $k$ is odd‎, ‎which shows that the‎ ‎number of 1-factors of $P(N,k)$ is exponential in this case and‎ ‎confirms a conjecture due to Lovász and Plummer (Ann‎. ‎New York Acad‎. ‎Sci‎. ‎576(2006)‎, ‎no‎. ‎1‎, ‎389-398).

متن کامل

A new method for 3-D magnetic data inversion with physical bound

Inversion of magnetic data is an important step towards interpretation of the practical data. Smooth inversion is a common technique for the inversion of data. Physical bound constraint can improve the solution to the magnetic inverse problem. However, how to introduce the bound constraint into the inversion procedure is important. Imposing bound constraint makes the magnetic data inversion a n...

متن کامل

A full Nesterov-Todd step interior-point method for circular cone optimization

In this paper, we present a full Newton step feasible interior-pointmethod for circular cone optimization by using Euclidean Jordanalgebra. The search direction is based on the Nesterov-Todd scalingscheme, and only full-Newton step is used at each iteration.Furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.

متن کامل

T-ADIC L-FUNCTIONS OF p-ADIC EXPONENTIAL SUMS

The T -adic deformation of p-adic exponential sums is defined. It interpolates all classical p-power order exponential sums over a finite field. Its generating L-function is a T -adic entire function. We give a lower bound for its T -adic Newton polygon and show that the lower bound is often sharp. We also study the variation of this L-function in an algebraic family, in particular, the T -adic...

متن کامل

Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

متن کامل

IRREDUCIBILITY OF POLYNOMIALS MODULO p VIA NEWTON POLYTOPES

Ostrowski established in 1919 that an absolutely irreducible integral polynomial remains absolutely irreducible modulo all sufficiently large prime numbers. We obtain a new lower bound for the size of such primes in terms of the number of integral points in the Newton polytope of the polynomial, significantly improving previous estimates for sparse polynomials.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004